A Cross-Domain Alliance Authentication Scheme based on Bilinear Group
نویسندگان
چکیده
منابع مشابه
A Cross-Domain Alliance Authentication Scheme based on Bilinear Group
With the development of grid computing, cloud computing and other large distributed network technology, users need them to provide services of unlimited space and unlimited speed. In order to meeting this request of users, all the domains in these large distributed networks need coordination for each other. For ensuring the safety to access resources in all domains, we propose a crossdomain uni...
متن کاملCross-domain Authentication Alliance Protocol Based on Isomorphic Groups
With the development of information technology in distributed network, such as cloud computing and grid computing. They need mutual coordination resources among the various areas to meet the requirement in infinite speed and infinite space of information technology for people. To ensure secure access resources among areas, the paper proposes a cross-domain authentication allianceagreement. This...
متن کاملA Union Authentication Protocol of Cross-domain Based on Bilinear Pairing
With the development of network service technology such as grid computing, cloud computing, the cooperation among multiply domains is needed for these intelligent services that have the unlimited space and the unlimited speed. This paper proposes a new union authentication protocol of cross-domain that can ensure the security of resource access in different domains, where the register keys of m...
متن کاملA Novel Identity-based Group Signature Scheme from Bilinear Maps
We propose an identity-based group signature scheme from bilinear maps. The scheme has the security properties of group signatures. Our scheme is based on the CDHP assumption and bilinear maps between groups. The size of the group pubic key and the length of the signature are independent on the number of group members. Furthermore, a group member can sign many message using the same key pair.
متن کاملA New ID-based Group Signature Scheme from Bilinear Pairings
We argue that traditional ID-based systems from pairings seem unsuitable for designing group signature schemes due to the problem of key escrow. In this paper we propose new ID-based public key systems without trustful KGC from bilinear pairings. In our new ID-based systems, if dishonest KGC impersonates an honest user to communicate with others, the user can provide a proof of treachery of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics & Information Sciences
سال: 2014
ISSN: 1935-0090,2325-0399
DOI: 10.12785/amis/080347